On constructing permutations of finite fields
نویسندگان
چکیده
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.
منابع مشابه
Constructing permutations of finite fields via linear translators
We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.
متن کاملPermutations via linear translators
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with com...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملCyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials
In this paper we study permutations of finite fields Fq that decompose as products of cycles of the same length, and are obtained using monomials x ∈ Fq[x]. We give the necessary and sufficient conditions on the exponent i to obtain such permutations. We also present formulas for counting the number of this type of permutations. An application to the construction of encoders for turbo codes is ...
متن کاملOn the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
We show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least by 9.47. This bound shows that this class has the largest such limit among all classes of permutations avoiding a single permutation of length 4 and refutes the conjecture that the Stanley–Wilf limit of a class of permutations avoiding a single permutation of length k cannot exceed (k−1)2. The result is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 17 شماره
صفحات -
تاریخ انتشار 2011